Subspace Least Squares Multidimensional Scaling
نویسندگان
چکیده
Multidimensional Scaling (MDS) is one of the most popular methods for dimensionality reduction and visualization of high dimensional data. Apart from these tasks, it also found applications in the field of geometry processing for the analysis and reconstruction of non-rigid shapes. In this regard, MDS can be thought of as a shape from metric algorithm, consisting of finding a configuration of points in the Euclidean space that realize, as isometrically as possible, some given distance structure. In the present work we cast the least squares variant of MDS (LS-MDS) in the spectral domain. This uncovers a multiresolution property of distance scaling which speeds up the optimization by a significant amount, while producing comparable, and sometimes even better, embeddings.
منابع مشابه
Distance-Based Partial Least Squares Analysis
Distances matrices are traditionally analyzed with statistical methods that represent distances as maps such as Metric Multidimensional Scaling (MDS), Generalized Procrustes Analysis (GPA), Individual Differences Scaling (INDSCAL), and DISTATIS. MDS analyzes only one distance matrix at a time while GPA, INDSCAL and DISTATIS extract similarities between several distance matrices. However, none o...
متن کاملTime-distance Mapping: Visualization of Transportation Level of Service
Time-distance mapping is a method to obtain a spatial configuration of points, so that the Euclidean distances between points consist with the given time distances. The approaches are divided broadly into two categories. One deals with the time-distances between all pairs of points. Multidimensional scaling (MDS) is generally applied to the solution. Another deals with the limited number of tim...
متن کاملMultidimensional Scaling with City-Block Distances
Multidimensional scaling is a technique for exploratory analysis of multidimensional data. The essential part of the technique is minimization of a function with unfavorable properties like multimodality, invariants and non-differentiability. Recently various two-level optimization algorithms for multidimensional scaling with city-block distances have been proposed exploiting piecewise quadrati...
متن کاملMultidimensional scaling and regression
Constrained multidimensional scaling was put on a firm theoretical basis by Jan De Leeuw and Willem Heiser in the 1980's. There is a simple method of fitting, based on distance via innerproducts, and a numerically more complicated one that is truly based on least-squares on distances. The unconstrained forms are known as principal coordinate analysis and nonmetric multidimensional scaling, resp...
متن کاملThe out-of-sample problem for classical multidimensional scaling
Out-of-sample embedding techniques insert additional points into previously constructed configurations. An out-of-sample extension of classical multidimensional scaling is presented. The out-of-sample extension is formulated as an unconstrained nonlinear least-squares problem. The objective function is a fourth-order polynomial, easily minimized by standard gradient-based methods for numerical ...
متن کامل